Resolvability in Subdivision of Circulant Networks Cn1,k

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Wirelength of Circulant Networks

One of the central issues in designing and evaluating an interconnection network is to study how well other existing networks can be embedded into this network. In this paper, we present an algorithm for finding the exact wirelength of circulant networks into a family of grids and prove its correctness using the Congestion lemma and Partition lemma. AMS Subject Classification: 05C

متن کامل

Combinatorial Properties of Circulant Networks

We have extended our work in [1] and this paper investigates combinatorial properties of circulant networks including best containers, wide diameter, fault diameter and Rabin number. These properties have received much attention recently in the study of interconnection networks. In addition to these parameters we introduce fault wide diameter and study this parameter for circulant networks.

متن کامل

Resolvability and Monotone Normality

A space X is said to be κ-resolvable (resp. almost κ-resolvable) if it contains κ dense sets that are pairwise disjoint (resp. almost disjoint over the ideal of nowhere dense subsets). X is maximally resolvable iff it is ∆(X)-resolvable, where ∆(X) = min{|G| : G 6= ∅ open}. We show that every crowded monotonically normal (in short: MN) space is ω-resolvable and almost μ-resolvable, where μ = mi...

متن کامل

Locating and Identifying Codes in Circulant Networks

A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or it has a neighbour in S. In other words S is dominating if the sets S ∩N [u] where u ∈ V (G) and N [u] denotes the closed neighbourhood of u in G, are all nonempty. A set S ⊆ V (G) is called a locating code in G, if the sets S ∩ N [u] where u ∈ V (G) \ S are all nonempty and distinct. A set S ⊆ V ...

متن کامل

Resolvability of references in users' personal collections

Introduction. Digital library users collect, enhance and manage their online reference collections to facilitate their research tasks. These personal collections, therefore, are likely to reflect users' interests, and are representative of their profile. Understanding these collections offers great opportunities for developing personalized digital library services, such as reference recommender...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Dynamics in Nature and Society

سال: 2020

ISSN: 1026-0226,1607-887X

DOI: 10.1155/2020/4197678